Past Member
Luca Trevisan
Affiliation
Mathematics
Field of Study
Computational Complexity
From
–
Luca Trevisan is working on applications to computer science of techniques from additive combinatorics, as well as on problems in computational complexity related to approximation algorithms and to pseudorandomness.
Dates at IAS
Member
School of Mathematics
–
Fall
Degrees
University of Rome
Ph.D.
1997